TSTP Solution File: ANA115^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA115^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:40:32 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 32 ( 10 unt; 13 typ; 0 def)
% Number of atoms : 64 ( 21 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 214 ( 12 ~; 3 |; 0 &; 195 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 55 ( 13 ^ 32 !; 6 ?; 55 :)
% ( 4 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
'type/realax/real': $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'type/nums/num': $tType ).
thf(func_def_2,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
'const/realax/real_of_num': 'type/nums/num' > 'type/realax/real' ).
thf(func_def_4,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_5,type,
'const/iterate/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
thf(func_def_6,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_12,type,
sK0: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_13,type,
sK1: 'type/nums/num' ).
thf(func_def_14,type,
sK2: 'type/nums/num' ).
thf(func_def_16,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[],[f19,f16]) ).
thf(f16,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/FINITE_NUMSEG_') ).
thf(f19,plain,
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) )
!= $true ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
( ( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) )
!= $true )
| ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ) ) ),
inference(superposition,[],[f15,f17]) ).
thf(f17,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > 'type/nums/num'] :
( ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X2 )
=> ( ( 'const/iterate/sum' @ X0 @ X2
@ ^ [X3: X0] : ( 'const/realax/real_of_num' @ ( X1 @ X3 ) ) )
= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X2 )
=> ( ( 'const/iterate/sum' @ X0 @ X2
@ ^ [X3: X0] : ( 'const/realax/real_of_num' @ ( X1 @ X3 ) ) )
= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_') ).
thf(f15,plain,
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK0 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ Y0 ) ) ) )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK0 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_NUMSEG_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : ANA115^1 : TPTP v8.2.0. Released v7.0.0.
% 0.08/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n008.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 07:52:22 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a TH1_THM_EQU_NAR problem
% 0.16/0.31 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.33 % (21242)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.33 % (21239)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (21236)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.16/0.33 % (21240)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (21237)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.16/0.33 % (21238)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.16/0.33 % (21241)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.16/0.33 % (21243)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.33 % (21239)Instruction limit reached!
% 0.16/0.33 % (21239)------------------------------
% 0.16/0.33 % (21239)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (21239)Termination reason: Unknown
% 0.16/0.33 % (21239)Termination phase: Saturation
% 0.16/0.33 % (21240)Instruction limit reached!
% 0.16/0.33 % (21240)------------------------------
% 0.16/0.33 % (21240)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (21240)Termination reason: Unknown
% 0.16/0.33 % (21240)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (21240)Memory used [KB]: 1023
% 0.16/0.33 % (21240)Time elapsed: 0.003 s
% 0.16/0.33 % (21240)Instructions burned: 2 (million)
% 0.16/0.33 % (21240)------------------------------
% 0.16/0.33 % (21240)------------------------------
% 0.16/0.33
% 0.16/0.33 % (21239)Memory used [KB]: 5500
% 0.16/0.33 % (21239)Time elapsed: 0.003 s
% 0.16/0.33 % (21239)Instructions burned: 3 (million)
% 0.16/0.33 % (21239)------------------------------
% 0.16/0.33 % (21239)------------------------------
% 0.16/0.33 % (21241)First to succeed.
% 0.16/0.33 % (21237)Instruction limit reached!
% 0.16/0.33 % (21237)------------------------------
% 0.16/0.33 % (21237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (21237)Termination reason: Unknown
% 0.16/0.33 % (21237)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (21237)Memory used [KB]: 5500
% 0.16/0.33 % (21237)Time elapsed: 0.003 s
% 0.16/0.33 % (21237)Instructions burned: 4 (million)
% 0.16/0.33 % (21237)------------------------------
% 0.16/0.33 % (21237)------------------------------
% 0.16/0.33 % (21243)Instruction limit reached!
% 0.16/0.33 % (21243)------------------------------
% 0.16/0.33 % (21243)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (21243)Termination reason: Unknown
% 0.16/0.33 % (21243)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (21243)Memory used [KB]: 5500
% 0.16/0.33 % (21243)Time elapsed: 0.004 s
% 0.16/0.33 % (21243)Instructions burned: 4 (million)
% 0.16/0.33 % (21243)------------------------------
% 0.16/0.33 % (21243)------------------------------
% 0.16/0.33 % (21238)Also succeeded, but the first one will report.
% 0.16/0.33 % (21241)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (21241)------------------------------
% 0.16/0.33 % (21241)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (21241)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (21241)Memory used [KB]: 5500
% 0.16/0.33 % (21241)Time elapsed: 0.004 s
% 0.16/0.33 % (21241)Instructions burned: 2 (million)
% 0.16/0.33 % (21241)------------------------------
% 0.16/0.33 % (21241)------------------------------
% 0.16/0.33 % (21235)Success in time 0.004 s
% 0.16/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------